An Enhanced Jaya Algorithm with a Two Group Adaption

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Multi-core Implementation of the Jaya Optimisation Algorithm

In this work, we propose a hybrid parallel Jaya optimisation algorithm for a multi-core environment with the aim of solving large-scale global optimisation problems. The proposed algorithm is called HHCPJaya, and combines the hyper-population approach with the hierarchical cooperation search mechanism. The HHCPJaya algorithm divides the population into many small subpopulations, each of which f...

متن کامل

An Adaption of the Jaynes Decision Algorithm

There are two types of decisions: given the estimated state of affairs, one decides to change oneself in a certain way (that is best suited for the given conditions); given what one is, one decides to change the state of affairs in a certain way (that is best suited for what one wants for oneself). Jaynes' approach to decision theory accounts only for the first type of decisions, the case when ...

متن کامل

ERA: An Efficient Rate Adaption Algorithm with Fragmentation

An effective rate adaptation is one of the main challenges in wireless networks with multi-rate support. This work aims to design an effective rate adaptation algorithm. To fulfill this goal, we study the behavior of a system under different rate adaptation operations with simulations, investigate the frame loss nature in rate adaptation dynamics and analyze the effectiveness of different respo...

متن کامل

An Algorithm for Two Dimensional Cutting Stock Problems with Demand

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

متن کامل

An Algorithm for Two Dimensional Cutting Stock Problems with Demand

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computational Intelligence Systems

سال: 2017

ISSN: 1875-6883

DOI: 10.2991/ijcis.2017.10.1.73